Using Very Fast Simulated Annealing in the Weighted AB Semblance method

Very Fast Simulated Re-Annealing

Simulated annealing , weighted simulated an -

Two well known stochastic optimization algorithms, simulated annealing and genetic algorithm are compared when using a sample to minimize an objective function which is the expectation of a random variable. Since they lead to minimum depending on the sample, a weighted version of simulated annealing is proposed in order to reduce this kind of overt bias. The algorithms are implemented on an opt...

Very fast Simulated Annealing for HW-SW partitioning

Hardware/software (HW-SW) partitioning is a key problem in the codesign of embedded systems and has been studied extensively in the past. With the wide availability of commercial platforms such as the Virtex-II Pro series from Xilinx that integrate processors with reconfigurable logic, one major existing challenge is the lack of efficient algorithms that can generate very high-quality solutions...

Fast Simulated Re - Annealing

An algorithm is developed to statistically find the best global fit of a nonlinear non-convex cost-function over a D-dimensional space. It is argued that this algorithm permits an annealing schedule for ''temperature'' T decreasing exponentially in annealing-time k, T = T 0 exp(−ck 1/D). The introduction of re-annealing also permits adaptation to changing sensitivities in the multi-dimensional ...

Velocity analysis using weighted semblance

Increasing the resolution of semblance-based velocity spectra, or semblance spectra, can improve the accuracy of normal moveout velocity estimates. The resolution of semblance spectra depends on the sensitivity of semblance to changes in velocity. By weighting terms in the semblance calculation that are more sensitive to changes in velocity, we can increase resolution. Our implementation of wei...